On a Markov Modulated Chain Exhibiting Self-Similarities over Finite Timescale
نویسندگان
چکیده
Recent papers have pointed out that data traac exhibits self-similarity, but self-similarity is observed only on a nite timescale. In order to account for that, we introduce the concept of pseudo long-range dependences. In this paper, we describe a Modulated Markov process producing self-similarity on a nite timescale; the process is quite easy to manipulate and depends only on three parameters (two real numbers and one integer). An advantage of using it is that it is possible to re-use the well-known analytical queuing theory techniques developed in the past in order to evaluate network performance. A quantitative method based on the decomposability theory of Courtois is given to evaluate the domain of validity where the process exhibits pseudo long-range dependences. The validation on a queuing problem is also discussed. Finally, we analyze the inputs of a statistical multiplexer in the context of a project called Scalability Enhancements for Connection-Oriented Networks (SCONE).
منابع مشابه
A Markov Modulated process for self - similar tra cStephan
Recent papers have pointed out that data traac exhibits self-similarity, but self-similarity is observed only on a nite timescale. In order to account for that, we introduce the concept of pseudo long-range dependencies. In this paper, we describe a Modulated Markov process producing self-similarity on a nite timescale; the process is quite easy to manipulate and depends only on three parameter...
متن کاملA Markov Modulated process for self-similar tra c
Recent papers have pointed out that data tra c exhibits self-similarity, but self-similarity is observed only on a nite timescale. In order to account for that, we introduce the concept of pseudo long-range dependencies. In this paper, we describe a Modulated Markov process producing self-similarity on a nite timescale; the process is quite easy to manipulate and depends only on three parameter...
متن کاملRandomized Difference Two-Timescale Simultaneous Perturbation Stochastic Approximation Algorithms for Simulation Optimization of Hidden Markov Models
We propose two finite difference two-timescale simultaneous perturbation stochastic approximation (SPSA) algorithms for simulation optimization of hidden Markov models. Stability and convergence of both the algorithms is proved. Numerical experiments on a queueing model with high dimensional parameter vectors demonstrate orders of magnitude faster convergence using these algorithms over related...
متن کاملRelative Entropy Rate between a Markov Chain and Its Corresponding Hidden Markov Chain
In this paper we study the relative entropy rate between a homogeneous Markov chain and a hidden Markov chain defined by observing the output of a discrete stochastic channel whose input is the finite state space homogeneous stationary Markov chain. For this purpose, we obtain the relative entropy between two finite subsequences of above mentioned chains with the help of the definition of...
متن کاملModeling and Simulation of Self-Similar Traffic in Wireless IP Networks
The paper examines self-similar properties of real telecommunications network traffic data over a wide range of time scales. These self-similar properties are very different from the properties of traditional models based on Poisson and Markov-modulated Poisson processes. Simulation with stochastic and long range dependent traffic source models is performed, and the algorithms for buffer overfl...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Perform. Eval.
دوره 27/28 شماره
صفحات -
تاریخ انتشار 1996